//
//  YKQueue.h
//  ProjectM
//
//  Created by gaofeng on 2021/5/12.
//

#ifndef YKQueue_h
#define YKQueue_h
#include "YKTree.h"
#include <stdio.h>
#define kMaxQueueLen 20
typedef struct {
    int data[kMaxQueueLen];
    int front,rear;
}SqQueue;
typedef struct {
    BiTree data[kMaxQueueLen];
    int front,rear;
}*SPQueue;
void initQueue(SqQueue *Q);
int isEmpty(SqQueue Q);
int EnQueue(SqQueue *Q,int x);
int DeQueue(SqQueue *Q,int *x);

void initPQueue(SPQueue Q);
int isPEmpty(SPQueue Q);
int EnPQueue(SPQueue Q,BiTree x);
int DePQueue(SPQueue Q,BiTree *x);
#endif /* YKQueue_h */
